"""
1*1与2*1的方块，铺满N的方案总数，就是Fib
"""
F = [0 for i in range(81)]
F[0] = F[1] = 1
for i in range(2, 81):
    F[i] = F[i - 1] + F[i - 2]
    
nofkase = int(input())
for kase in range(nofkase):
    print(int(F[int(input())]))